منابع مشابه
Mutual friends: Charles Dickens and Great Ormond Street Children's Hospital
methodological shortcoming we now possess a compendium which provides useful insights into various anthropological concepts in the period between 1750 and 1850. Every scholar involved in the history of the life sciences to the beginning of the so-called scientific era will gratefully profit from the innumerable new historical insights in this book. In 1909 "the editor of a standard edition of D...
متن کاملMutual best friendship involvement, best friends' rejection sensitivity, and psychological maladaptation.
Rejection sensitivity (RS) refers to the tendency to anxiously expect, readily perceive, and overreact to experiences of possible rejection. RS is a clear risk factor for psychological maladaptation during early adolescence. However, there is growing evidence of significant heterogeneity in the psychological correlates of RS. To investigate when RS poses the greatest psychological risk during e...
متن کاملAn Improved Algorithm for Mutual Friends Recommendation Application of SNS in Hadoop
In Social network system, existing “people you might know” or “Mutual friends” recommending applications are commonly utilized to list two-hop mediate relationships that one could have with another in order to tighten the bonds among groups. However, as the number of SNS users increase dramatically, the relationship data get so huge that the performance of Mutual Friends recommendation system b...
متن کاملRanking Friends ∗
We investigate the scope for cooperation within a community engaged in repeated reciprocal interactions. Players seek the help of others and approach them sequentially according to some fixed order, that is, a ranking profile. We study the ranking profiles that correspond to the social structures that are most effective in sustaining cooperation in equilibrium, that is, social structures that s...
متن کاملA fast algorithm for identifying Friends-of-Friends halos
We describe a simple and fast algorithm for identifying friends-of-friends clusters and prove its correctness. The algorithm avoids unnecessary expensive neighbor queries, uses minimal memory overhead, and rejects slowdown in high over-density regions. We define our algorithm formally based on pair enumeration, a problem that has been heavily studied in fast 2-point correlation codes and our re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1988
ISSN: 0028-0836,1476-4687
DOI: 10.1038/335659d0